Topological Broadcasting Using Parameter Sensitivity-Based Logical Proximity Graphs in Coordinated Ground-Flying Ad Hoc Networks

نویسندگان

  • Vishal Sharma
  • Rajesh Kumar
  • Neeraj Rathore
چکیده

Ad hoc networks have been used in wide range of applications. These networks have become versatile as far implementation is concerned. Such networks have been used from static deployment to mobile network formations. Apart from Mobile Ad Hoc Networks (MANETs) and Vehicular Ad Hoc Networks (VANETs), another ad hoc formation with mobile nodes is the aerial ad hoc networks also termed as Flying Ad Hoc Networks (FANETs). A coordinated network formation between the ground ad hoc network and aerial ad hoc network provides vast applications in both civilian and military activities. Various existing issues of mobile networks can easily be resolved using aerial network formations. However, these networks similar to the traditional ad hoc formations are having a major issue of broadcast storming and network partitioning. These issues hinder the performance of such networks. Broadcast storming refers to replication of similar data in the network that increases the overheads which ultimately leads to network failure. In this paper, broadcast storming is considered as a problem and a possible solution is provided for it by keeping control over network partitioning issues. The proposed approach uses parameter sensitivity which is derived over optimized value of nodes configurations to form a topological arrangement. This topological arrangement is formed using logical proximity graphs which operate over link weight and parameter sensitivity. The proposed route discovery strategy under the proposed approach is capable of handling issues related to broadcast storms without affecting the network performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Feedback Based Mechanism for Video Streaming Over Multipath Ad Hoc Networks

Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...

متن کامل

Intuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks

In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...

متن کامل

Flying Ad-Hoc Networks (FANETs): A survey

One of the most important design problems for multi-UAV (Unmanned Air Vehicle) systems is the communication which is crucial for cooperation and collaboration between the UAVs. If all UAVs are directly connected to an infrastructure, such as a ground base or a satellite, the communication between UAVs can be realized through the in-frastructure. However, this infrastructure based communication ...

متن کامل

Cluster Based Cross Layer Intelligent Service Discovery for Mobile Ad-Hoc Networks

The ability to discover services in Mobile Ad hoc Network (MANET) is a major prerequisite. Cluster basedcross layer intelligent service discovery for MANET (CBISD) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. The cluster basedarchitecture using semantic knowledge provides scalability and accuracy. Also, the mini...

متن کامل

Faster Deterministic Broadcasting in Ad Hoc Radio Networks

We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log n). Our main...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JoWUA

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2015